全文获取类型
收费全文 | 2542篇 |
免费 | 196篇 |
国内免费 | 125篇 |
专业分类
化学 | 330篇 |
晶体学 | 9篇 |
力学 | 132篇 |
综合类 | 58篇 |
数学 | 1631篇 |
物理学 | 703篇 |
出版年
2024年 | 3篇 |
2023年 | 46篇 |
2022年 | 50篇 |
2021年 | 59篇 |
2020年 | 68篇 |
2019年 | 71篇 |
2018年 | 66篇 |
2017年 | 98篇 |
2016年 | 109篇 |
2015年 | 72篇 |
2014年 | 178篇 |
2013年 | 182篇 |
2012年 | 128篇 |
2011年 | 139篇 |
2010年 | 131篇 |
2009年 | 182篇 |
2008年 | 165篇 |
2007年 | 152篇 |
2006年 | 127篇 |
2005年 | 106篇 |
2004年 | 81篇 |
2003年 | 69篇 |
2002年 | 79篇 |
2001年 | 67篇 |
2000年 | 67篇 |
1999年 | 68篇 |
1998年 | 60篇 |
1997年 | 37篇 |
1996年 | 27篇 |
1995年 | 19篇 |
1994年 | 31篇 |
1993年 | 22篇 |
1992年 | 10篇 |
1991年 | 17篇 |
1990年 | 10篇 |
1989年 | 4篇 |
1988年 | 9篇 |
1987年 | 3篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 2篇 |
1983年 | 3篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 5篇 |
1979年 | 2篇 |
1976年 | 2篇 |
1973年 | 1篇 |
1972年 | 1篇 |
1936年 | 1篇 |
排序方式: 共有2863条查询结果,搜索用时 890 毫秒
1.
2.
《Operations Research Letters》2022,50(3):274-280
The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets. 相似文献
3.
WANG Zhong HONG Haitao XIAO Hai SUN Changku MENG Yan YE Shenghua 《Chinese Journal of Lasers》1997,6(5):435-440
1.IntroductionAbsolutedistancemeasurementisfarfromanewtopic.However,itisstillafieldstimulatinggreatinterestsnowadaysduetoitSimportantroleinmanufacturingandassembly['J.SincethegreatsuccessachievedbyMichelsonandBenoitwhentheyfirstdevelopedaninterferometertodeterminethestandardmeterintermsofthemonochromaticredcadmiumline,theopticinterferometerhasbeenprovedtobeoneofthemostpreciseandefficientwayindisplacementmeasurementbecauseofitshighdiscriminationandsimplestructure.However,thetraditionalinterfe… 相似文献
4.
Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained. 相似文献
5.
Tor Schoenmeyr David Yu Zhang 《Journal of Algorithms in Cognition, Informatics and Logic》2005,57(2):130-139
The string matching with mismatches problem requires finding the Hamming distance between a pattern P of length m and every length m substring of text T with length n. Fischer and Paterson's FFT-based algorithm solves the problem without error in O(σnlogm), where σ is the size of the alphabet Σ [SIAM–AMS Proc. 7 (1973) 113–125]. However, this in the worst case reduces to O(nmlogm). Atallah, Chyzak and Dumas used the idea of randomly mapping the letters of the alphabet to complex roots of unity to estimate the score vector in time O(nlogm) [Algorithmica 29 (2001) 468–486]. We show that the algorithm's score variance can be substantially lowered by using a bijective mapping, and specifically to zero in the case of binary and ternary alphabets. This result is extended via alphabet remappings to deterministically solve the string matching with mismatches problem with a constant factor of 2 improvement over Fischer–Paterson's method. 相似文献
6.
Heikki Hyyr 《Journal of Discrete Algorithms》2005,3(2-4):215-229
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(km/wn) algorithm of Wu and Manber, the O((k+2)(m−k)/wn) algorithm of Baeza-Yates and Navarro, and the O(m/wn) algorithm of Myers, where m is the pattern length, n is the text length, k is the error threshold and w is the computer word size. In this paper we discuss a uniform way of modifying each of these algorithms to permit also a fourth type of edit operation: transposing two adjacent characters in the pattern. This type of edit distance is also known as Damerau edit distance. In the end we also present an experimental comparison of the resulting algorithms. 相似文献
7.
本文提出的MMD算法用于提高模型区别错误信息和正确信息的能力.利用该算法在对模型的参数进行重估计时.涉及到复杂的目标函数的梯度运算.击运用矩阵运算使得梯度运算变得简单明了,因此本文给出了MMD算法下的HMM参数重估计的矩阵表示形式并给出了证明. 相似文献
8.
9.
We deal with MAXH0-FREE PARTIAL SUBGRAPH. We mainly prove that 3-locally optimum solutions achieve approximation ratio (δ0+1)/(B+2+ν0), where B=maxv∈VdG(v), δ0=minv∈V(H0)dH0(v) and ν0=(|V(H0)|+1)/δ0. Next, we show that this ratio rises up to 3/(B+1) when H0=K3. Finally, we provide hardness results for MAXK3-FREE PARTIAL SUBGRAPH. 相似文献
10.
We present an O(min(Kn,n2)) algorithm to solve the maximum integral multiflow and minimum multicut problems in rooted trees, where K is the number of commodities and n is the number of vertices. These problems are NP-hard in undirected trees but polynomial in directed trees. In the algorithm we propose, we first use a greedy procedure to build the multiflow then we use duality properties to obtain the multicut and prove the optimality. 相似文献